A Survey of 3sum-Hard Problems
نویسنده
چکیده
The 3sum problem is defined as follows: given a set S of n integers, do there exist three elements {a, b, c} ∈ S such that a + b + c = 0? This is a linear satisfiability problem. 3sum can be solved using a simple algorithm with Θ(n) runtime (sort S, then test 3-tuples intelligently) and it is widely believed that Ω(n) is the lower bound for the worst-case runtime of any solution to the 3sum problem.
منابع مشابه
More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems
We present an algorithm that solves the 3SUM problem for n real numbers in O((n/ log n)(log log n)) time, improving previous solutions by about a logarithmic factor. Our framework for shaving off two logarithmic factors can be applied to other problems, such as (median,+)-convolution/matrix multiplication and algebraic generalizations of 3SUM. We also obtain the first subquadratic results on so...
متن کاملConstructing the Visibility Graph for N Line Segments in On
There are many problems in computational geometry for which the best know algorithms take time (n) (or more) in the worst case while only very low lower bounds are known. In this paper we describe a large class of problems for which we prove that they are all at least as di cult as the following base problem 3sum: Given a set S of n integers, are there three elements of S that sum up to 0. We c...
متن کاملOn a Class of O(n2) Problems in Computational Geometry
There are many problems in computational geometry for which the best know algorithms take time 19(n 2) (or more) in the worst case while only very low lower bounds are known. In this paper we describe a large class of problems for which we prove that they are all at least as difficult as the following base problem 3SUM: Given a set S of n integers, are there three elements of S that sum up to 0...
متن کاملHow Hard is it to Find (Honest) Witnesses?
In recent years much effort has been put into developing polynomial-time conditional lower bounds for algorithms and data structures in both static and dynamic settings. Along these lines we introduce a framework for proving conditional lower bounds based on the well-known 3SUM conjecture. Our framework creates a compact representation of an instance of the 3SUM problem using hashing and domain...
متن کاملHigher Lower Bounds from the 3SUM Conjecture
The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds on dynamic data structures and graph problems. This line of work was initiated by Pǎtraşcu (STOC 2010) who reduced 3SUM to an offline SetDisjointness problem. However, the reduction introduced by Pǎtraşcu suffers from several inefficiencies, making it difficult to obtain tight conditional lower bounds from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004